Block-Intersection Graphs of Steiner Triple Systems
نویسندگان
چکیده
A Steiner triple system of order n is a collection of subsets of size three, taken from the n-element set {0, 1, ..., n−1}, such that every pair is contained in exactly one of the subsets. The subsets are called triples, and a block-intersection graph is constructed by having each triple correspond to a vertex. If two triples have a non-empty intersection, an edge is inserted between their vertices. It is known that there are eighty Steiner triple systems of order 15 up to isomorphism. In this paper, we attempt to distinguish the eighty systems using their block-intersection graphs, as well as discuss general properties of block-intersection graphs of Steiner triple systems. Index words: Steiner triple system, Block-intersection graph, Isomorphism, Spectra Block-Intersection Graphs of Steiner Triple Systems
منابع مشابه
Hamilton Decompositions of Block-Intersection Graphs of Steiner Triple Systems
Block-intersection graphs of Steiner triple systems are considered. We prove that the block-intersection graphs of non-isomorphic Steiner triple systems are themselves non-isomorphic. We also prove that each Steiner triple system of order at most 15 has a Hamilton decomposable block-intersection graph.
متن کاملDecomposing block-intersection graphs of Steiner triple systems into triangles
The problem of decomposing the block intersection graph of a Steiner triple system into triangles is considered. In the case when the block intersection graph has even degree, this is completely solved, while when the block intersection graph has odd degree, removal of some spanning subgraph of odd degree is necessary before the rest can be decomposed into triangles. In this case, some decompos...
متن کاملThe chromatic index of block intersection graphs of Kirkman triple systems and cyclic Steiner triple systems
The block intersection graph of a combinatorial design with block set B is the graph with B as its vertex set such that two vertices are adjacent if and only if their associated blocks are not disjoint. The chromatic index of a graph G is the least number of colours that enable each edge of G to be assigned a single colour such that adjacent edges never have the same colour. A graph G for which...
متن کاملSteiner Triple Systems and Existentially Closed Graphs
We investigate the conditions under which a Steiner triple system can have a 2or 3-existentially closed block intersection graph.
متن کاملThe Fine Intersection Problem for Steiner Triple Systems
The intersection of two Steiner triple systems (X,A) and (X,B) is the set A ∩ B. The fine intersection problem for Steiner triple systems is to determine for each v, the set I(v), consisting of all possible pairs (m,n) such that there exist two Steiner triple systems of order v whose intersection I satisfies | ∪A∈I A| = m and |I| = n. We show that for v ≡ 1 or 3 (mod 6), |I(v)| = Θ(v3), where p...
متن کامل